Supersingular Curves You Can Trust
نویسندگان
چکیده
Generating a supersingular elliptic curve such that nobody knows its endomorphism ring is notoriously hard task, despite several isogeny-based protocols relying on an object. A trusted setup often proposed as workaround, but aspects remain unclear. In this work, we develop the tools necessary to practically run distributed trusted-setup ceremony. Our key contribution first statistically zero-knowledge proof of isogeny knowledge compatible with any base field. To prove statistical ZK, introduce graphs Borel level structure and they have Ramanujan property. Then, analyze security protocol based our ZK in simplified universal composability framework. Lastly, optimized implementation proof, propose strategy concretely deploy protocol.
منابع مشابه
Can you Trust your Data?
A new program analysis is presented, and two compile time methods for this analysis are given. The analysis attempts to answer the question: “Given some trustworthy and some untrustworthy input, can we trust the value of a given variable after execution of some code”. The analyses are based on an abstract interpretation framework and a constraint generation framework respectively. The analyses ...
متن کامل"Alexa, Can I Trust You?"
Security diagnostics expose vulnerabilities and privacy threats that exist in commercial Intelligent Virtual Assistants (IVA) - diagnostics offer the possibility of securer IVA ecosystems.
متن کاملConstructing Supersingular Elliptic Curves
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((log q)). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based c...
متن کاملSupersingular Curves in Cryptography
Frey and Rück gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite field extension Fqk . The discrete logarithm problem can therefore be solved using index calculus algorithms as long as k is small. In the elliptic curve case it was shown by Menezes, Okamoto and Vanstone that for supersingular cu...
متن کاملQUATRO Plus: Quality You Can Trust?
The QUATRO Plus project, a follow on from the original QUATRO Project, aims to balance the wisdom of the crowds with the knowledge of the experts. It uses a mixture of authenticated data sources and the opinions of end users expressed through social networking software to build a dataset that is authoritative and trustworthy. The dataset describes online resources using RDF with the upcoming W3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-30617-4_14